Sequential multi-layer cognitive network optimization

ABSTRACT

System and methods for providing a cognitive network ( 300 ). The methods involve generating Initialization Parameters (“IPs”) for a first Multi-Objective Optimization (“MOO”) algorithm based on project requirements; determining a first Pareto Front (“PF”) for a first Protocol Stack Layer (“PSL”) of a protocol stack by solving the first MOO algorithm using IPS ( 450, 550 ); initialize or constrain a second MOO algorithm using the first PF ( 100 ); determining a second PF for a second PSL succeeding the first PSL using the second MOO algorithm; analyzing the first and second PFs to develop Best Overall Network Solutions (“BONSs”); ranking the BONSs according to a pre-defined criteria; identifying a top ranked solution for BONSs that complies with current regulatory and project policies; computing configuration parameters for protocols of PSLs that enable implementation of the top ranked solution within the cognitive network; and dynamically re-configuring network resources of PSLs using the configuration parameters.

STATEMENT OF THE TECHNICAL FIELD

The inventive arrangements relate to cognitive networks. More particularly, the inventive arrangements concern implementing systems and methods for providing sequential multi-layer cognitive network optimization.

DESCRIPTION OF THE RELATED ART

With the explosion of wireless data technologies and wireless based products/services leading to virtually insatiable demand for bandwidth, assigned spectrum under a traditional command and control regulatory model has become exhausted. As a result, a National Broadband Initiative (“NBI”) was started. The NBI calls for the re-allocation of 500 MHz of bandwidth from government use to commercial/civilian use by the end of the decade. In accordance with NBI, the military will have to vacate some of the bands which they have traditionally used for communications. There are two approaches that the military can take to adjust their communications systems accordingly.

A first approach involves modifying some of the military's Radio Frequency (“RF”) systems such that they operate in new spectral bands. The system modification can be achieved via static relocation. Static relocation is well known in the art, and therefore will not be described herein. There are two problems with a static relocation. The first problem is that certain bands are already critically over utilized. Any static relocation would either preserve the status quo or exacerbate the over utilization. The second problem is that multiple re-designs may be necessary when the band selected for relocation is subsequently re-allocated.

A second approach involves modifying the RF systems such that they comprise cognitive RF systems. This modification can be achieved by: moving from command/control based regulation to policy based regulation; and putting machine intelligence and spectral sensing in the RF devices to allow those devices to locate and utilize spectral “white spaces” (i.e., unused spectrum) on an as available basis and in compliance with the policies of the local governing bodies.

Cognitive communications can be used to coordinate the activities of other cognitive RF devices and networks of cognitive devices. The cognitive devices can include, but are not limited to, cognitive radars, cognitive sensors, cognitive jammers, and cognitive radios. Each cognitive radio uses cognitive technology to exclusively optimize its operations of a physical layer and/or a data link layer of a protocol stack. In contrast, a cognitive network uses cognitive technology to optimize the performance of the entire network.

A Network of Cognitive Radios (“NCRs”) is not the same thing as a cognitive network. An analogy from operations research is now discussed to demonstrate why the previous statement is true. In this regard, a protocol stack is thought of as an organization. Each protocol stack layer is thought of as a department in the organization. If one tries to optimize only one department, then the organization as a whole is sub-optimized or rendered non-functional. For example, an accounting department is told to “optimize” profits. To the accounting department in isolation that means minimize expenditures. The expenditures are minimized by not buying expensive capital equipment and costly materials, as well as not using highly paid skilled labor. As a result of such activities by the accounting department, a manufacturing department under performs because it must use low-quality equipment, materials and labor. Consequently, the organization as a whole under performs.

Conversely, the manufacturing department is told to “optimize” manufacturing operations by producing high quality products in a relatively small amount of time. In order to “optimize” the manufacturing operations, expensive equipment is purchased to minimize down time. Costly materials are purchased which are guaranteed to be without defect. Highly skilled labor is employed at premium salaries. As a result of such activities, the accounting department under performs because the products are produced with a cost that exceeds a sale price for a target market. Consequently, the organization as a whole under performs.

Similar to the two scenarios discussed above, if a physical layer confines itself to establishing high performing short distance links, then a network is forced to use a large number of hops to get data from a source device to a destination device. As a result of such activities, high latency packet congestion occurs within the network, as well as other phenomena that have detrimental effects on overall network performance.

Notably, practical cognitive radios and cognitive networks have yet to be developed and deployed. The closest “cousin” to cognitive networking currently is Traditional Cross Layer Optimization (“TCLO”). TCLO is inherently reactive since cross layer protocols are tuned based on observed sub-optimal performance. Also, TCLO is a single parameter optimization across two protocol stack layers. In TCLO, the protocol stack layers are not necessarily adjacent. Thus, a TCLO, that coordinates an encoding on the physical layer based on video encoding at an application layer, seeks just to ensure an optimal encoding scheme that maintains video quality. As a result of only optimizing the encoding scheme of the physical layer, other aspects of the video transfer are sub-optimized.

SUMMARY OF THE INVENTION

The invention concerns implementing systems and methods for providing a cognitive network. The methods involve generating initialization parameters for at least one first Multi-Objective Optimization (“MOO”) algorithm based on project requirements. The initialization parameters may be generated using information specifying a status and constraints that apply to protocol stack layer resources of at least one network node, and/or information concerning resources that are available on each network node of the cognitive network. Also, the initialization parameters may be generated in a distributed fashion in which at least two network nodes of the cognitive network assist in computing the initialization parameters. Alternatively, the initialization parameters are generated in a centralized fashion in which a single network node of the cognitive network computes the initialization parameters.

A first Pareto Front is then determined for a first protocol stack layer of a protocol stack by solving the first MOO algorithm using the initialization parameters. The first MOO algorithm can comprise a biologically inspired particle swarm optimization algorithm. Thereafter, the first Pareto Front is used to initialize or constrain at least one second MOO algorithm. The second MOO algorithm may be of the same or different type as the first MOO algorithm. Also, the second MOO algorithm may comprise a biologically inspired particle swarm optimization algorithm. The second MOO algorithm is used to determine a second Pareto Front for a second protocol stack succeeding the first protocol stack layer in the protocol stack. This process may be repeated until a Pareto Front for all protocol stack layers in the protocol stack have been determined.

Subsequently, the Pareto Fronts are analyzed in aggregate to develop a plurality of best overall network solutions. The best overall network solutions are then ranked according to a pre-defined criteria. A top ranked solution for the best overall network solutions is selected that complies with current regulatory and project policies. Configuration parameters are computed for protocols of at least the first and second protocol stack layers that enable implementation of the top ranked solution within the cognitive network. Finally, the configuration parameters are used to dynamically re-configuring network resources of at least the first and second protocol stack layers.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments will be described with reference to the following drawing figures, in which like numerals represent like items throughout the figures, and in which:

FIG. 1 is a graph illustrating an example of a Pareto front for two objective functions F1 and F2.

FIG. 2 is an exemplary two-dimensional representation of a figure set of non-inferior solutions.

FIG. 3 is a schematic illustration of an exemplary distributed multi-layer PSO based cognitive network.

FIGS. 4-5 each provide a diagram that is useful for understanding basic concepts employed by the cognitive network of FIG. 3.

FIG. 6 is a detailed block diagram of an exemplary network node.

FIG. 7 is a flow diagram of an exemplary method for providing a cognitive network.

DETAILED DESCRIPTION

It will be readily understood that the components of the embodiments as generally described herein and illustrated in the appended figures could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of various embodiments, as represented in the figures, is not intended to limit the scope of the present disclosure, but is merely representative of various embodiments. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.

The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by this detailed description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present invention should be or are in any single embodiment of the invention. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present invention. Thus, discussions of the features and advantages, and similar language, throughout the specification may, but do not necessarily, refer to the same embodiment.

Furthermore, the described features, advantages and characteristics of the invention may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize, in light of the description herein, that the invention can be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the invention.

Reference throughout this specification to “one embodiment”, “an embodiment”, or similar language means that a particular feature, structure, or characteristic described in connection with the indicated embodiment is included in at least one embodiment of the present invention. Thus, the phrases “in one embodiment”, “in an embodiment”, and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.

As used in this document, the singular form “a”, “an”, and “the” include plural references unless the context clearly dictates otherwise. Unless defined otherwise, all technical and scientific terms used herein have the same meanings as commonly understood by one of ordinary skill in the art. As used in this document, the term “comprising” means “including, but not limited to”.

Embodiments will now be described with respect to FIGS. 1-7. Embodiments generally relate to implementing systems and methods for providing a cognitive network. In mobile ad hoc tactical military networks or emergency service first responder networks, it is not desirable to have all of the cognitive network intelligence implemented by a single network node (e.g., a base station) because a disabling or removal of that network node would result in a failure of the entire cognitive network. Accordingly, the present invention may facilitate cognitive networks with distributed intelligence, i.e., the intelligence is implemented by a plurality of network nodes, rather than by a single network node. Some of the network nodes include, but are not limited to, mobile network nodes. As such, these mobile network nodes are capable of operating for a practical duration with a mobile power source.

The cognitive networks of the present invention comprise cross-layer optimization of a protocol stack to enable the network to meet dynamic project or mission requirements. Basing the cross-layer optimization of an Open System Interconnection (“OSI”) protocol stack on PSO in general and on biologically inspired PSOs employing Swarm Intelligence (“SI”) specifically facilitates matching essential characteristics of the base optimization method with key behavioral requirements of each protocol stack layer and inherent capability to couple the optimization algorithms across multiple processing elements. OSI protocol stacks, PSOs and SI are well known in the art, and therefore will not be described in detail herein. Still, a very brief discussion of an OSI protocol stack, a PSO and SI is provided below to assist a reader in understanding the present invention.

An OSI protocol stack includes a plurality of protocol stack layers for performing respective functions. The protocol stack layers include the following seven layers: (1) a physical layer; (2) a data link layer; (3) a network layer; (4) a transport layer; (5) a session layer; (6) a presentation layer; and (7) an application layer. The physical layer is generally configured to perform media, signal and binary transmission functions. The data link layer is generally configured to perform physical addressing functions. The network layer is generally configured to perform path determination and logical addressing functions. The transport layer is generally configured to perform end-to-end connection, reliability and flow control functions. The session layer is generally configured to perform inter-host communication and application session management functions. The presentation layer is generally configured to perform data representation, encryption, decryption, and data conversion functions. The application layer is generally configured to perform software application interaction functions.

PSO is generally an MOO Artificial Intelligence (“AI”) based technique to finding a solution to a problem. As such, a PSO is also referred to in the art as a Multi-Objective PSO (“MOPSO”). An MOPSO technique generally involves: obtaining a population of candidate solutions (“particles”); and moving each particle in a search space with a velocity according to its own previous best solution and its group's best solution. A particle's position may be updated in accordance with the following mathematical equations (1) and (2).

Δx _(id) =Δx _(id) +c ₁ rand1( )(p _(id) −x _(id))+c ₂ rand2( )(p _(gd) −x _(id))  (1)

x _(id) =x _(id) +Δx _(id)  (2)

where x_(id) represents a position of a particle. Δx_(id) represents a position change of the particle. c₁ and c₂ are positive constants. rand1 and rand2 are random numbers between 0 and 1. p_(id) represents a previous best solution for the particle. p_(gd) represents the previous best solution for the group.

A biologically inspired PSO employs SI. SI is generally the collective behavior of decentralized, self-organized system made up of a population of simple simulation agents interacting locally with one another and with their environment. The simulation agents follow very simple rules. Although there is no centralized control structure dictating how individual simulation agents should behave, local, simple and to a certain degree random interactions between such simulation agents lead to the emergence of “intelligent” global behavior. Natural examples of SI include, but are not limited to, ant colonies, honey bee colonies, honey bee swarms, brains, fish schools, and locust swarms. Accordingly, SI algorithms include, but are not limited to, an Artificial Ant Colony Algorithm (“AACA”), an Artificial Bee Colony Algorithm (“ABCA”), an Artificial Honey Bee Swarm (“AHBS”), an Artificial Brain Algorithms (“ABA”′), an Artificial Fish Swarm Algorithm (“AFSA”), and an Artificial Locust Swarm Algorithm (“ALSA”). AACAs, ABCAs, AHBSs, ABAs, AFSAs and ALSAs are well known in the art, and therefore will not be described in detail herein. Still, a brief discussion of AACAs, ABCAs and AHBSs is provided below for purposes of assisting the reader in understanding the present invention.

The AACA is modeled on the actions of an ant colony. Artificial ants (“simulation agents”) locate optimal solutions by moving through a parameter space representing all possible solutions. Natural ants lay down pheromones directing each other to resources while exploring their environment. The artificial ants similarly record their positions and the quality of their solutions, so that in later simulation iterations more artificial ants locate better solutions.

The ABCA is modeled on the foraging behavior of honey bees. The ABCA has three phases: an employed bee phase; an onlooker bee phase; and a scout bee phase. In the employed bee phase and the onlooker bee phase, artificial bees (“simulation agents”) exploit sources by local searches in a neighborhood of solutions selected based on deterministic selection in the employed bee phase and the probabilistic selection in the onlooker bee phase. In the scout bee phase, solutions that are not beneficial anymore for search progress are abandoned, and new solutions are inserted instead of them to explore new regions in the search space.

The AHBS is modeled on the swarming behavior of honey bees. When a bee colony becomes too large for a hive, part of the colony splits off and swarms to a new hive location. Prior to the split of the colony using behavior similar to foraging behavior, scout bees identify the best possible location for a new hive. The scout bees return to the original colony. When the colony splits, the scout bees guide the swarming bees to the new hive location. The swarm does not identify the scout bees who know the new location, a small percentage of the swarm is the scout bees that know the location. The scout bees do not occupy a lead position, but are randomly distributed in the swarm. The scout bees “steer” the swarm to the location of the new hive because every bee in the swarm follows three simple rules in flight: move in the same direction as your neighbors; remain close to your neighbors; and avoid collisions with your neighbors.

In some scenarios, other types of MOO algorithms are employed in addition to PSO algorithms and/or biologically inspired PSO algorithms for providing the cognitive capabilities of the cognitive network. The other types of MOO algorithms include, but are not limited to: a Normal Boundary Intersection (“NBI”) algorithm; a modified NBI algorithm; a Normal Constraint (“NC”) algorithm; a successive Pareto optimization algorithm; a Pareto Surface GENeration (“PGEN”) algorithm for convex multi-objective instances; an Indirect Optimization on the basis of Self-Organization (“IOSO”) algorithm; an S-Metric Selection Evolutionary Multi-Objective Algorithm (“SMS-EMOA”); a Reactive Search Optimization (“RSO”) algorithm; and/or a Benson's algorithm for linear vector optimization problems. Each of the listed MOO algorithms is well known in the art, and therefore will not be described herein.

Still, it should be understood that every MOO algorithm (including PSOs, MOPSOs and biologically inspired PSOs) yields an N-dimensional Pareto Front of non-inferior solutions, where N is the number of objectives. The non-inferior solutions are solutions where any deviation along any objective axis results in that solution being dominated by a better solution. An example of a Pareto Front 100 for two objective functions F1 and F2 is shown in FIG. 1. As shown in FIG. 1, a set of Pareto-Optimal solutions 104 comprise the Pareto Front 100. Once the Pareto Front is formed, another algorithm can be used to select a best overall solution based on some a priori selected criteria.

Because MOO algorithms and their Pareto Fronts are essential elements of the present invention, a more detailed overview of these concepts is now presented. In many practical optimization based reasoning algorithms with multiple constraints (variables), MOO provides superior results since a single objective with several constraints may not adequately represent the problem. In MOO, instead of a large number of constraints, there is a vector of objectives, F(x)=[F₁(x), F₂(x), . . . F_(m)(x)], that must be traded off in some way.

Let G_(i)(x) be a constant or bound. MOO's goal is the minimization of the objective vector F(x) subject to those constraints or bounds. That is:

${\min\limits_{x \in R^{n}}{F(x)}},{{subject}\mspace{14mu} {to}}$ G_(i)(x) = 0, i = 1, 2, …  , k_(e); G_(i)(x) ≤ 0, i = k_(e) + 1, 2, …  , k; l ≤ x ≤ u

where k_(e) is the number of equality constraints. k−k_(e) is the number of inequality constraints. l is the lower bound of x. u is the upper bound of x.

Note that because F(x) is a vector, if any of the components of F(x) are competing, then there is no unique solution to this problem. Instead, the concept of non-inferiority must be used to characterize the objectives. A non-inferior solution is one in which an improvement in one objective requires a degradation of another objective. To define this concept more precisely, consider a feasible region, Ω, in the parameter space. x is an element of the n-dimensional real numbers xεR^(n) that satisfies all the constraints, i.e.,

x={ΩεR ^(n)}, subject to G _(i)(x)=0,i=1,2, . . . ,k _(e) ;G _(i)(x)≦0,i=k _(e)+1,2, . . . ,k;l≦x≦u

This allows for the following definition of the corresponding feasible region for the fitness function Λ.

Λ={yεR ^(m) :y=F(x),xεΩ}.

The performance vector F(x) maps parameter space into fitness function space.

A non-inferior solution point is defined as: Point x*εΩ is a non-inferior solution if for some neighborhood of x* there does not exist a Δx such that (x*+Δx)εΩ and

F _(i)(x*Δx)≦F _(i)(x*),i=1,2, . . . ,m and

F _(j)(x*+Δx)<F _(j)(x*) for at least one j.

An exemplary two-dimensional representation of a figure set of non-inferior solutions is provided in FIG. 2. As shown in FIG. 2, the set of non-inferior solutions lies on the curve between point C and point D. Points A and B represent specific non-inferior points. Points A and B are clearly non-inferior solution points because an improvement in one objective F₁ requires a degradation in the other objective F₂, i.e., F_(1B)<F_(1A), F_(2B)>F_(2A). Since any point in Ω that is an inferior point represent a point in which improvement can be attained in all the objectives, it is clear that such a point is of no value. MOO is therefore concerned with the generation and selection of non-inferior solution points. Non-inferior solutions are also called Pareto-Optimal solutions. A general goal in MOO is constructing the Pareto-Optimal solutions.

Exemplary Systems Implementing the Present Invention

Exemplary systems of the present invention will now be described in relation to FIGS. 3-6. The following discussion describes an approach to optimize the protocols of the network protocol stack layers for a wireless cognitive network. When the cognitive and other functions required for command and control is distributed, various PSO algorithms are used as the basis of command and control communication. The PSO algorithms can be thought of as not only supplying some of the required machine intelligence, but also acting in an information compression roll for inter-processor or inter-node messages.

Referring now to FIG. 3, there is provided a schematic illustration of an exemplary cognitive network 300 that is useful for understanding the present invention. Although the cognitive network 300 is shown as generally having a radio system network architecture, the present invention is not limited in this regard. The cognitive network 300 can alternatively comprise a different network architecture defined by base stations, base station controllers, and/or various types of communication devices. In the radio system network architecture scenario, the cognitive network 300 comprises a plurality of portable radios 302-310. The portable radios 302-310 can include, but are not limited to, Software Defined Radios (“SDRs”) with spectral sensing capabilities. SDRs are well known in the art, and therefore will not be described in detail herein.

Cognitive network 300 is multiple-parameter optimized so that its overall project or mission metrics are met, and not just one parameter that is either specific to a protocol stack layer or shared by only two protocol stack layers. PSO is employed by cognitive network 300 for achieving the multiple-parameter optimization. In this regard, it should be understood that different PSO models can be used, each with properties aligned with the characteristics of a particular protocol stack layer, to form the basis of a distributed cross-layer cognitive engine. For example, a distributed biologically inspired PSO technique employing an AHBS is used for optimizing operations of a physical layer of an OSI protocol stack because of its messaging characteristics. A distributed biologically inspired PSO technique employing an AACA is used for optimizing operations of a data link layer of the OSI protocol stack because of its pheromone inspired finite fading memory and reinforcement property. The present invention is not limited to the particularities of this example. Other examples can be provided in which distributed biologically inspired and/or non-biologically inspired PSOs are used in protocol stack layers to minimize non-payload inter-processor or inter-node communication as shown in FIG. 3 and which match the requirements thereof.

Notably, the PSO models and distributed intelligence algorithm parameters employed by cognitive network 300 can be dynamically adjusted during operations thereof. This dynamic adjustment can be made in accordance with changes in network requirements and network conditions. For example, the PSO models and distributed intelligence algorithm parameters may be dynamically changed based on changes in latency requirements, bandwidth requirements, and/or other communication requirements. The PSO models and distributed intelligence algorithm parameters may additionally or alternatively be dynamically changed based on changes in data bursts, network latency, network load, network download speed, network upload speed, and/or available bandwidth.

Biologically inspired PSOs generally display many properties that are consistent with the cognitive requirements of networks that are required to coordinate themselves via RF communication to meet changing project, mission, radio environment, and policy conditions. The “particles” in biologically inspired PSOs are computation agents which communicate locally via simple messaging which collectively form an intelligent entity (“the swarm”). In the cognitive network 300 context, the computation agents comprise processing devices 312-320 contained in the network nodes 302-310. The processing devices 312-320 form a distributed processor which is instantiated in all of the network nodes 302-310. The distributed processor 312-320 includes hardware (i.e., electronic circuits) and/or software configured to perform the basic concepts described below in relation to FIGS. 4-5 and methods described below in relation to FIG. 7.

A function of the distributed processor 312-320 is to compress information that must be shared by all network nodes 302-310 to keep the network operation near optimal with a minimum of overhead in ever changing requirements and conditions. The network nodes 302-310 can include, but are not limited to, cognitive radios. The cognitive radios in the network nodes 302-310 form the physical layer of the cognitive network 300. The network nodes 302-310 will be described in detail below in relation to FIG. 6.

Notably, as a consequence of using biologically inspired PSOs, the computational loading can be dynamically partitioned across all active processing elements in a network node or across all active network nodes 302-310 based on the number of processing elements in a node, the processing capacity of each processing element, the number of network nodes, node information density, and system level computational requirements. This is beneficial when the computational capability of the cognitive network 300 grows asymptotically and when the computational capacity of the cognitive network 300 exceeds the asymptotic limit of the computational requirement but that of a single node does not. In the case of computational load sharing across network nodes, the computational load of each network node 302-310 can be scaled back as more nodes join the network 300, thus reducing the power draw of each network node 302-310 to extend the life of the power source and likely decrease its heat and electromagnetic radiation signature.

Referring now to FIG. 4, there is provided a conceptual diagram 400 that is useful for understanding operations performed by a cognitive network node in the cognitive network 300 or the cognitive network 300. As noted above, cognitive network 300 generally employs a distributed intelligence algorithm for optimizing its overall performance. The distributed intelligence algorithm is implemented by the distributed processor 312-320 which is instantiated in the network nodes 302-310 of the cognitive network 300. Accordingly, the functions of functional blocks 404-440 of conceptual diagram 400 are achieved by performing corresponding operations in a single processor, in multiple co-located processors or at the distributed processor 312-320 of the network nodes 302-310.

As shown in FIG. 4, new or updated project or mission requirements 402 are received at a single processor, by multiple co-located processors or by the distributed processor 312-320 of cognitive network 300. The project/mission requirements 402 may be in a standard ontology. The standard ontology represents project/mission requirements as a set of concepts within a domain, and the relationships among these concepts. As such, in some scenarios, the ontology includes a plurality of terms and an index. The index defines a plurality of relationships between the terms and project/mission requirements 402. A project/mission requirement is identified based on at least one term and the index.

After receiving the project/mission requirements 402, operations for optimization algorithm initialization are performed in functional block 404. Such operations include using at least one AI algorithm and/or at least one Table Look Up (“TLU”) method to compute initialization parameters 450 for a plurality of optimization algorithms which collectively are to be used to optimize performance of the cognitive network 300. In some scenarios, the AI algorithm includes, but is not limited to, a symbolic AI algorithm, a sub-symbolic AI algorithm, or a statistical AI algorithm. Each of the listed types of AI algorithms is well known in the art, and therefore will not be described herein.

Also, the type of AI algorithm(s) and/or initialization parameter(s) can be selected in accordance with a particular “use case”. The term “use case”, as used herein, refers to a methodology used in system analysis to identify, clarify, and organize system requirements. A “use case” is made up of a set of possible sequences of interactions between system components (e.g., network nodes) and users in a particular environment and related to a particular goal. A “use case” can have the following characteristics: organizes functional requirements; models the goals of system/user interactions; records paths from trigger events to goals; describes one main flow of events and/or exceptional flow of events; and/or is multi-level such that another “use case” can use the functionalities thereof.

The functions of block 404 are achieved using feedback layer constraints 438 derived from successful project/mission executions. Block 404 uses the successful project/mission feedback layer constraints to “learn” and to later use said successful project/mission feedback layer constraints to generate initialization parameters in future similar use cases. The “learning” mechanisms for the aforementioned algorithms are well known in the art, and therefore will not be described in detail herein. These inputs are then used to determine a previously seen similar set of circumstances and the corresponding end results. The end results are then used for initialization. The feedback layer constraints 438 include information concerning the status and constraints that apply to protocol stack layer resources of at least one network node. For example, a peak in computational load required for a receive side physical layer to overcome a severe channel distortion may limit the capabilities of a transmit side application layer to concurrently apply a computationally intense algorithm. In this scenario, the functions of block 404 may have to initialize certain optimization algorithms toward solutions requiring moderate computational loading in other protocol stack layers.

The functions of block 404 are also achieved using network-related information concerning the resources that are available on each network node 302-310. The functions for maintaining an updated knowledge base of such network-related information are performed in functional block 460. In some scenarios, the network-related information includes, but is not limited to, a free computational capacity of each network node, a reserve power of each network node, and/or a spectral environment of each network node. Also, the network-related information may be updated on a pre-defined periodic bases.

In some scenarios, the operations of functional block 404 are performed in a distributed fashion in which all network nodes assist in computing the initialization parameters 450. However, in other scenarios, the initialization parameters 450 are computed by a single network node, and then distributed to the remaining network nodes. Still, in yet other scenarios, the initialization parameters 450 are computed using only a select few of the network nodes, and then distributed to the remaining network nodes. In the last scenarios, geographically close network nodes are grouped so as to define a sub-cognitive network. One of the network nodes of the sub-cognitive network is selected to compute the initialization parameters for itself and the other network nodes of the sub-cognitive network. Such a sub-cognitive network configuration is power and security efficient.

Once the initialization parameters 450 have been computed, they are distributed to functional blocks 406-418. In functional block 406, the initialization parameters 450 and/or the network-related information are used for determining possible outcomes that are Pareto efficient when different values for protocol stack layer parameters are employed. In this regard, a first Pareto Front for at least one MOO algorithm can be determined in functional block 406. Pareto Fronts are well known in the art, and briefly described above.

In some scenarios, a Pareto Front for at least one MOO algorithm is determined in functional block 406 which may result in protocol optimization of a physical layer. In some scenarios, the MOO algorithms employed in functional block 406 can include distributed biologically inspired PSO algorithms. The present invention is not limited in this regard. Functional block 406 can additionally or alternatively employ other types of MOO algorithms.

The Pareto Front for the physical layer is then used to initialize or constrain the MOO algorithm(s) for the data link layer. In this regard, functional block 408 determines a second Pareto Front by solving the MOO algorithm(s) employed for the data link layer using the first Pareto Front determined in block 406. The MOO algorithms employed in block 408 can include, but are not limited to, biologically inspired PSO algorithms.

Similarly, a Pareto Front for at least one MOO algorithm is determined in each functional block 410-418 which may result in protocol optimization of a network layer, a transport layer, a session layer, a presentation layer, or an application layer. In this regard, the MOO algorithm(s) used in each functional block 408-418 is (are) initialized or constrained by the Pareto Front Related Initialization and Reasoning (“PFRIR”) blocks 481, 483, 485, 487, 489, 491 based on the Pareto Fronts 480, 482, 484, 486, 488, 490 computed for the immediately preceding protocol stack layer. The initialization and constraint parameters provided to the MOO algorithm(s) used in each functional block 480-418 are shown by arrows 401-411 of FIG. 4. For example, a third Pareto Front is determined for the network layer using at least one MOO algorithm that is initialized or constrained based on the second Pareto Front previously determined for the data link layer. A fourth Pareto Front is determined for the transport layer using at least one MOO algorithm that is initialized or constrained based on the third Pareto Front previously determined for the network layer. A fifth Pareto Front is determined for the session layer using at least one MOO algorithm that is initialized or constrained based on the fourth Pareto Front determined for the transport layer. A sixth Pareto Front is determined for the presentation layer using at least one MOO algorithm that is initialized or constrained based on the fifth Pareto Front determined for the session layer. A seventh Pareto Front is determined for the application layer using at least one MOO algorithm that is initialized or constrained based on the sixth Pareto Front determined for the presentation layer. Embodiments of the present invention are not limited to the particularities of the above described exemplary Pareto Front determination process. In other scenarios, the protocol stack may be absent of the session layer and presentation layer. Therefore, the Pareto Front for the application layer may alternatively be determined based on the fourth Pareto front previously determined for the transport layer.

The MOO algorithms employed in functional blocks 406-418 can include, but are not limited to, PSO algorithms and other MOO algorithms other than PSO algorithms. The PSO algorithms can include distributed biologically inspired PSO algorithms. The number and types of MOO algorithms employed for each protocol stack layer can be selected in accordance with a particular “use case”. The same or different type of MOO algorithm can be used for optimizing protocols of each of the protocol stack layers. For example, a first biologically inspired PSO (e.g., a distributed AHBS) can be used for optimizing protocols of a data link layer and/or a physical layer of an OSI protocol stack. A second different biologically inspired PSO (e.g., an AACA) can be used for optimizing protocols of a network layer of the OSI protocol stack. A first MOO (e.g., an SMS-EMOA algorithm) and/or a third PSO can be used for optimizing protocols of a transport layer of the OSI protocol stack. A second different MOO (e.g., a successive Pareto optimization) and/or a fourth PSO can be used for optimizing protocols of a session layer, presentation layer, and/or application layer of the OSI protocol stack. The third and fourth PSOs can be the same as or different than the first biologically inspired PSO or second biologically inspired PSO. The present invention is not limited in this regard.

Notably, the MOO algorithm(s) used in each functional block 406-418 may be unique thereto and/or customized to the requirements of a respective protocol stack layer. Also, the MOO algorithm(s) for each protocol stack layer can be part of a larger distributed intelligence algorithm implemented by the plurality of network nodes 302-310. In this regard, inter-node communications may or may not be required for facilitating functions of blocks 406-418. If inter-node communications are required for facilitating functions of a block 406-418, then the inter-node communications may or may not be part of the larger distributed intelligence algorithm. In the cases of each protocol stack layer being part of a larger distributed intelligence algorithm implemented by the plurality of network nodes 302-310, at least one distributed PSO is employed in a functional block 406-418 as the distributed MOO algorithm when the inter-node communications therefore comprise part of the larger distributed intelligence algorithm.

After the Pareto Fronts have been calculated for all of the protocol stack layers, additional computations are performed in functional block 422 to develop the best overall network solutions. The term “best overall network solution”, as used herein, refers to an optimal solution for overall protocol stack configuration given at least the current network architecture, current network environment, current network conditions, current project/mission requirements, and current project/mission objectives.

The best overall network solution functions of functional block 422 may be implemented in a distributed fashion in which a plurality of network nodes perform some of the “additional computations” or a centralized fashion in which a single network node performs all of the “additional computations”. The additional computations involve: applying another set of algorithms to the entire solution spaces including the Pareto Fronts; developing the best overall network solutions based on the solutions for the algorithms; and ranking the best overall network solutions according to a set of criteria appropriate to a specific application space and conditions in which the cognitive network is operating.

The set of algorithms used in best overall network solution functions of functional block 422 can include, but are not limited to, Case-Based Reasoning (“CBR”) algorithms, expert system algorithms, and neural network algorithms. Such algorithms are well known in the art, and therefore will not be described in detail herein. Still, it should be understood that inputs to functional block 422 may include, but are not limited to, project-related inputs, mission-related inputs, network topology inputs, and/or RF environment inputs. These inputs are then used to determine a previously seen similar set of circumstances and the corresponding end result. The end results are then used for initialization of configuration optimization. If a CBR algorithm or a neural network algorithm is used in functional block 422, then the end results may be fed back for use in a next iteration of said algorithm. In contrast, if expert system algorithms are employed in functional block 422, then the end results may not be fed back.

The ranked “best overall network solutions” are then analyzed in functional block 422 to: identify which solutions are compliant with current regulatory policies and/or project/mission policies; and identify a top ranked solution from the identified solutions. If no ranked “best overall network solutions” are policy compliant, then a policy engine 440 attempts to “suggest” possible approaches that would bring the cognitive network system 300 into compliance and the “suggested” possible approaches are then supplied to functional block 404 for use thereby. In response, a second iteration of the functions of blocks 404-422, 481, 483, 485, 487, 489, 491 are performed to generate policy compliant solutions.

If at least one ranked “best overall network solution” is policy compliant, then a “favored solution” is selected in functional block 422. Configuration parameters 470 are then computed for the protocols of the protocol stack layers that enable an implementation of the “favored solution” within the cognitive network 300. Subsequently, the network resources of the protocol stack layers are configured in accordance with the respective configuration parameters 470, as shown by functional blocks 424-436. The network resources remain in their current configuration until the project/mission changes, the network topology changes and/or the network's operating environment changes.

Going back to the analogy of the multi-department organization, the basic concept applied by the present invention is akin to a department being told to come back with a report explaining various ways to optimize that department. The Chief Executive Officer (“CEO”) then digests each report and develops suggestions for how the next department, which interacts frequently with the previously completed department, should constrain its plan to be as compatible as possible with its adjacent department. Once that department has developed a set of options, it sends it to the CEO and the CEO initiates the next iteration until all departments have developed a set of compatible options. The overall goal of the CEO is to optimize the performance of the entire organization as much as possible without excessive interaction and iteration. The acts performed by the CEO are akin to the functions performed in blocks 481, 483, 485, 487, 489, 491.

Referring now to FIG. 5, there is provided a conceptual diagram 500 that is useful for understanding operations performed by a cognitive network (e.g., cognitive network 300). As noted above in relation to FIG. 4, a cognitive network can perform operations to initialize or constrain an MOO technique for each protocol stack layer based on a Pareto Front previously determined for an immediately proceeding protocol stack layer. In FIG. 4, the processes of bocks 406-418 start at the bottom of the protocol stack, i.e., the physical layer. In contrast, the processes of block 506-518 start at the top of the protocol stack, i.e., the application layer. The functions performed in blocks 504-536, 540, 560 are the same as or similar to those performed by blocks 404-436, 440, 460 of FIG. 4. Therefore, the discussion provided above in relation to blocks 404-436, 440, 460 is sufficient for understanding the operations of blocks 504-536, 540, 560. However, a brief discussion of the “top down” process of blocks 506-518 will be described below to assist a reader in understanding the present invention.

As shown in FIG. 5, initialization parameters 550 are computed and distributed to functional blocks 506-518. In functional block 518, the initialization parameters 550 and/or the network-related information are used for determining possible outcomes that are Pareto efficient when different values for protocol stack layer parameters are employed. In this regard, a first Pareto Front for at least one MOO algorithm can be determined in functional block 518. Pareto Fronts are well known in the art, and briefly described above.

The Pareto Front for the application layer is then used to initialize or constrain the MOO algorithm(s) for the presentation layer. In this regard, functional block 516 determines a second Pareto Front by solving the MOO algorithm(s) employed for the presentation layer using the first Pareto Front determined in block 518.

Similarly, a Pareto Front for at least one MOO algorithm is determined in each functional block 506-514 which may result in protocol optimization of a physical layer, a data link layer, a network layer, a transport layer, or a session layer. In this regard, the MOO algorithm(s) used in each functional block 506-516 is (are) initialized or constrained by the Pareto Front Related Initialization and Reasoning (“PFRIR”) blocks 581, 583, 585, 587, 589, 591 based on the Pareto Fronts 582, 584, 586, 588, 590, 592 computed for the immediately preceding protocol stack layer. The initialization and constraint parameters provided to the MOO algorithm(s) used in each functional block 506-516 shown by arrows 501-511 of FIG. 5. For example, a third Pareto Front is determined for the session layer using at least one MOO algorithm that is initialized or constrained based on the second Pareto Front previously determined for the presentation layer. A fourth Pareto Front is determined for the transport layer using at least one MOO algorithm that is initialized or constrained based on the third Pareto Front previously determined for the session layer. A fifth Pareto Front is determined for the network layer using at least one MOO algorithm that is initialized or constrained based on the fourth Pareto Front determined for the transport layer. A sixth Pareto Front is determined for the data link layer using at least one MOO algorithm that is initialized or constrained based on the fifth Pareto Front determined for the network layer. A seventh Pareto Front is determined for the physical layer using at least one MOO algorithm that is initialized or constrained based on the sixth Pareto Front determined for the data link layer. Embodiments of the present invention are not limited to the particularities of the above described exemplary Pareto Front determination process. In other scenarios, the protocol stack may be absent of the session layer and presentation layer. Therefore, the Pareto Front for the transport layer may alternatively be determined based on the first Pareto Front previously determined for the application layer.

After a Pareto Front is determined for all protocol stack layers, additional computations are performed in functional block 522 to develop the best overall network solutions. The additional computations involve: applying another set of algorithms to the entire solution spaces including the Pareto Fronts; developing the best overall network solutions based on the solutions for the algorithms; and ranking the best overall network solutions according to a set of criteria appropriate to a specific application space and conditions in which the cognitive network is operating.

The ranked “best overall network solutions” are then analyzed in functional block 522 to: identify which solutions are compliant with current regulatory policies and/or project/mission policies; and identify a top ranked solution from the identified solutions. If no ranked “best overall network solutions” are policy compliant, then a policy engine 540 attempts to “suggest” possible approaches that would bring the cognitive network system into compliance and the “suggested” possible approaches are then supplied to functional block 504 for use thereby. In response, a second iteration of the functions of blocks 504-522, 581, 583, 585, 587, 589, 591 are performed to generate policy compliant solutions.

If at least one ranked “best overall network solution” is policy compliant, then a “favored solution” is selected in functional block 522. Configuration parameters 570 are then computed for the protocols of the protocol stack layers that enable an implementation of the “favored solution” within the cognitive network. Subsequently, the network resources of the protocol stack layers are configured in accordance with the respective configuration parameters 570, as shown by functional blocks 524-536. The network resources remain in their current configuration until the project/mission changes, the network topology changes and/or the network's operating environment changes.

Referring now to FIG. 6, there is provided a detailed bock diagram of an exemplary network node 302 that is useful for understanding the present invention. The network nodes 304-310 of FIG. 3 can be the same as or similar to network node 302. As such, the discussion of network node 302 is sufficient for understanding network nodes 304-310. As should be understood, the network nodes 302-310 form the physical layer of the cognitive network 300 as well as the host platform for some or all of the other protocol stack layers.

Network node 302 can include more or less components than those shown in FIG. 6. However, the architecture of network node 302 shown in FIG. 6 is sufficient for facilitating optimization of operations of cognitive network 300 as described above. In this regard, network node 302 implements at least a portion of a method for providing a distributed multi-layer PSO based cognitive network. Exemplary embodiments of said method will be described below in relation to FIG. 7.

In some scenarios, network node 302 comprises an SDR with a spectral sensing capability. SDRs are well known in the art, and therefore will not be described in detail herein. Still, it should be understood that the network node 302 is software configured in RF characteristics and software programmable in protocol stack layers.

As shown in FIG. 6, the network node 302 comprises an antenna 602 for receiving and transmitting RF signals. A receive/transmit (Rx/Tx) switch 604 selectively couples the antenna 602 to the transmitter circuitry 606 and receiver circuitry 608 in a manner familiar to those skilled in the art. The receiver circuitry 608 demodulates and decodes the RF signals received from another network node (e.g., the network node 304 of FIG. 3) to derive information therefrom. The receiver circuitry 608 is coupled to a controller 610 via an electrical connection 634. The receiver circuitry 608 provides the decoded RF signal information to the controller 610. The controller 610 uses the decoded RF signal information in accordance with the function(s) of the network node 302. The controller 610 also provides information to the transmitter circuitry 606 for encoding and modulating information into RF signals. Accordingly, the controller 610 is coupled to the transmitter circuitry 606 via an electrical connection 638. The transmitter circuitry 606 communicates the RF signals to the antenna 602 for transmission to an external device (e.g., network node 304 of FIG. 3).

An optional antenna 640 is coupled to an optional Global Positioning System (“GPS”) receiver circuitry 614 for receiving GPS signals. The GPS receiver circuitry 614 demodulates and decodes the GPS signals to extract GPS location information therefrom. The GPS location information indicates the location of the network node 302. The GPS receiver circuitry 614 provides the decoded GPS location information to the controller 610. As such, the GPS receiver circuitry 614 is coupled to the controller 610 via an electrical connection 636. The controller 610 uses the decoded GPS location information in accordance with the function(s) of the network node 302.

The controller 610 stores the decoded RF signal information and the decoded GPS location information in a memory 612 of the network node 302. Accordingly, the memory 612 is connected to and accessible by the controller 610 through an electrical connection 632. The memory 612 can be a volatile memory and/or a non-volatile memory. For example, the memory 612 can include, but is not limited to, a Random Access Memory (“RAM”), a Dynamic Random Access Memory (“DRAM”), a Static Random Access Memory (“SRAM”), a Read-Only Memory (“ROM”), a disk drive, a flash memory, and/or any combination thereof. The memory 612 can also have stored therein hardware resource data 662, hardware environment data 664, policy data 692, and instructions 650. The hardware resource data 662 includes, but is not limited to, data specifying at least one capability of the network node 302. The hardware environment data 664 includes, but is not limited to, data characterizing a network node environment. The policy data 692 includes, but is not limited to, data specifying current regulatory policies and/or project/mission policies.

The instructions 650 can also reside, completely or at least partially, within the controller 610 during execution thereof by the network node 302. In this regard, the memory 612 and the controller 610 can constitute machine-readable media. The term “machine-readable media”, as used here, refers to a single medium or multiple media that store the one or more sets of instructions 650. The term “machine-readable media”, as used here, also refers to any medium that is capable of storing, encoding or carrying the set of instructions 650 for execution by the network node 302 and that cause the network node 302 to perform one or more of the methodologies of the present disclosure.

The controller 610 is also connected to a user interface 630. The user interface 630 is comprised of input devices (not shown), output devices (not shown), and software routines (not shown) configured to allow a user to interact with and control software applications (not shown) installed on the network node 302. Such input and output devices can respectively include, but are not limited to, a display, a speaker, a keypad, a directional pad, a directional knob, a microphone, and a PTT button. Each of the listed input and output devices is well known in the art, and therefore will not be described herein.

As shown in FIG. 6, the network node 302 further comprises a processing device 312. The processing device 312 comprises an Environment Observation Component (“EOC”) 660 and elements of various components 696 of the processor. Such elements include a scenario synthesizer 670, a cognitive engine 676, and a policy engine 690. The processing device 312 may be part of a distributed processor 312-320. In this case, the processors 312-320 act as a distributed processor that employs a distributed intelligence algorithm for facilitating the optimization of the overall performance of the cognitive network 300. In such cases, the distributed processor 312-320 includes hardware (e.g., electronic circuits) and/or software configured to perform the operations described above in relation to FIGS. 4-5 and the method described below in relation to FIG. 7 in a distributed fashion. In this regard, the processing device 312 comprises an Environment Observation Component (“EOC”) 660 and elements of various distributed components 696 of the distributed processor. Such elements include a scenario synthesizer 670 of a distributed scenario synthesizer (not shown), a cognitive engine 676 of a distributed cognitive engine (not shown), and a policy engine 690 of a distributed policy engine (not shown).

As described above, initialization parameters 450, 550 for the intelligence algorithm are computed during operation of the cognitive network 300. In scenarios in which some or all of the initialization parameters are computed by network node 312, cognitive engine 676 of network node 312 includes an optional Initialization Parameter Generator (“IPG”) 652. IPG 652 is configured to use project/mission requirements 402, 502, feedback layer constraints 438, 538 and/or network-related information for computing the initialization parameters for the MOO algorithms 684 employed by itself and/or other network nodes 304-310. The initialization parameters can be computed using at least one AI algorithm 682 and/or TLU method. The type of AI algorithm 682 or initialization parameters can be selected in accordance with a particular “use case”, as described above. If the IPG 652 computes initialization parameters for other network nodes, then network node 312 communicates the initialization parameters to those other network nodes, respectively. The initialization parameters can be communicated via command and control communication. After the initialization parameters have been computed, the processing device 312 uses the respective initialization parameters and/or network-related information to facilitate the optimization of overall network performance.

In some scenarios, the initialization parameters are computed using CBR and/or fuzzy algebra. CBR and fuzzy algebra are well known in the art, and therefore will not be described in detail herein. However, a brief discussion of the operations performed by the network node 302 for computing the initialization parameters is provided below to assist a reader in understanding CBR scenarios.

In the CBR scenarios, the IPG 652 includes a CBR component 680 that is generally configured to receive case-related information from EOC 660 and process the same. In this regard, the EOC 660 performs operations to generate a Full Characterization of the Network Node Environment (“FCNNE”). FCNNE is generated by combining data 662, 664 with Radio Environment Map (“REM”) data 666. The REM data 666 characterizes a static local network node environment (e.g., hidden nodes, terrain, etc.) and distant network node environments. The REM data 666 is updatable via command and control communication. FCNNE is then communicated from the EOC 660 to the scenario synthesizer 670.

At the scenario synthesizer 670, FCNNE is combined with the current project/mission requirements 672 so as to synthesize a set of objectives 698, limits, and boundary conditions for the cognitive engine 676. The objectives 698 may be stored in memory 612 in a particular format (e.g., a table format). Thereafter, the objectives 698 are combined with the radio hardware environment data 664 to generate combined objective/environment data. The combined objective/environment data is used by the scenario synthesizer 670 to generate at least one case identifier. The case identifier(s) is (are) then communicated to the CBR component 678 of the cognitive engine 676. The CBR component 678 uses the case identifier(s) to: select the number of MOO algorithms that should be employed for each protocol stack layer; select the type of MOO algorithm(s) to be employed for each protocol stack layer; and/or determine the initialization parameters for the MOO algorithms 684.

Once the initialization parameters have been determined, they are used by the cognitive engine 676 to facilitate optimization of protocol stack performance. In this regard, a Pareto Front for each selected MOO algorithm 684 is determined. Notably, the MOO algorithms 684 comprise at least one MOO algorithm for a first protocol stack layer that is unique thereto and/or customized to the requirements thereof. In some scenarios, the first protocol stack layer includes the physical layer or the application layer. Also, a PSO algorithm (more particularly, a biologically inspired PSO algorithm) may be employed for the physical layer and/or the application layer. Each of the MOO algorithms (including PSOs and biologically inspired PSOs) yields an N-dimensional Pareto Front of non-inferior solutions, as described above.

As noted above, the MOO algorithms can be part of a larger distributed intelligence algorithm implemented by network node 302 and other network nodes 304-310 of the cognitive network 300. In this regard, inter-node communications may be required for computing the Pareto Fronts. Accordingly, in some scenarios, network node 302 communicates with other network nodes 304-310 using command and control communications for purposes of deriving a solution to one or more MOO algorithms 684.

After the cognitive engine 676 generates a first Pareto Front for the first protocol stack layer, it performs operations for generating a second Pareto Front for a second protocol stack layer (e.g., the data link layer or the presentation layer). The second Pareto Front is determined by solving the MOO algorithm(s) for the second protocol stack layer. The MOO algorithm(s) is (are) initialized and/or constrained using the first Pareto Front.

The process is repeated until a Pareto Front for each protocol stack layer is generated using MOO algorithm(s) that is (are) initialized and/or constrained using the immediate previous computed Pareto Front. For example, the MOO algorithm(s) employed for generating the Pareto Front for the data link layer may be initialized and/or constrained using parameters derived from the Pareto Front determined for the physical layer or the network layer depending on whether a “top down” process (e.g., the process shown in FIG. 5) or “bottom up” process (e.g., the process shown in FIG. 4) is implemented. Similarly, the MOO algorithm(s) employed for generating the Pareto Front for the network layer may be initialized and/or constrained using parameters derived from the Pareto Front determined for the data link layer or the transport layer depending on which process is implemented. Likewise, the MOO algorithm(s) employed for generating the Pareto Front for the transport layer may be initialized and/or constrained using parameters derived from the Pareto Front determined for the network layer or the session layer depending on which process is implemented, and so on.

Thereafter, the cognitive engine 676 communicates the Pareto Fronts to the policy engine 690. Notably, the policy engine 690 forms part of a distributed policy engine. The functions of such a distributed policy engine are described above in relation to functional block 440 of FIGS. 4 and 540 of FIG. 5. At least some of the functions described above in relation to functional block 440 of FIG. 4 and/or functional block 540 of FIG. 5 are performed by policy engine 590.

In this regard, additional operations are performed by the AI algorithms corresponding to block 422 of FIG. 4 and block 522 of FIG. 5 to facilitate the development of the best overall network solutions. The additional operations involve: applying additional algorithms at least to the Pareto Fronts generated by cognitive engine 676; assisting in the development of the best overall network solutions based on the solutions to the additional algorithms; and assisting in the ranking of the best overall network solutions according to a set of criteria appropriate to a specific application space and conditions in which the cognitive network 300 is operating. The additional algorithms can include, but are not limited to, CBR algorithms, expert system algorithms, and/or neural network algorithms.

Subsequently, the policy engine 690 assists in the analysis of the ranked best overall network solutions to: identify which solutions are compliant with current regulatory policies and project/mission policies; and identify a top ranked solution from the identified solutions. Policy compliance can be determined using the boundary conditions generated by scenario synthesizer 670. If no ranked best overall solutions are policy compliant, then the policy engine 690 assists in a determination of possible approaches that would bring the cognitive network 300 into compliance. The possible approaches are feedback to the MOOA component 684 or the CBR component 680 to give direction regarding how the solution can be brought into compliance. There is no fixed process for how the MOOA component 684 or the CBR component 680 uses the fed back information.

If at least one ranked best overall solutions is policy compliant, then it is passed to a Link Configuration Optimization (“LCO”) engine 694. The LCO engine 694 uses a radio resource cost function to down select to a single configuration solution. The solution is evaluated to assess quality.

Exemplary Methods Implementing the Present Invention

Referring now to FIG. 7, there is provided a flow diagram of an exemplary method for providing a cognitive network (e.g., cognitive network 300 of FIG. 3) that is useful for understanding the present invention. As shown in FIG. 7, method 700 begins with step 702 and continues with step 704. In step 704, project/mission requirements (e.g., project or mission requirements 402 of FIG. 4 or 502 of FIG. 5) are received. The project/mission requirements are then used in step 706 to generate initialization parameters for a plurality of MOO algorithms.

The initialization parameters can be generated using at least one AI algorithm and/or TLU method. The AI algorithm can include, but is not limited to, a CBR algorithm and/or a fuzzy algebra algorithm. The type of algorithm used in step 706 may be selected in accordance with a use case. The use case can be made up of a set of possible sequences of interactions between network components and users in a particular environment. In this regard, the initialization parameters may be generated using: information specifying a status and constraints that apply to protocol stack layer resources of at least one network node; and/or information concerning resources that are available on each network node of the cognitive network.

In some scenarios, step 706 is performed in a distributed fashion in which all network nodes of the cognitive network assist in generating the initialization parameters. In other scenarios, step 706 is performed in a centralized fashion in which a single network node generates the initialization parameters. In yet other scenarios, step 706 is performed in a semi-distributed fashion in which only a select few of the network nodes assist in the generation of the initialization parameters.

Once the initialization parameters have been generated, they are used to determine at least one Pareto Front (e.g., Pareto Front 100 of FIG. 1) for a first protocol stack layer of a protocol stack, as shown by step 708. The first protocol stack layer can include, but is not limited to, the physical layer if a “bottom up” process is employed or the application layer if a “top down” process is employed. The first Pareto Front is determined by solving the MOO algorithm(s) for the first protocol stack layer. The MOO algorithm can comprise a biologically inspired PSO algorithm. In some scenarios, a different type of MOO algorithm may be employed for the first protocol stack layer. In cases implementing inter-processor or inter-node distributed MOO algorithms, the type of distributed MOO algorithm to be employed for the first protocol stack layer can be selected based on an amount of non-payload inter-node communication and requirements of the protocol stack layer. Similarly, in said cases, the number of distributed MOO algorithms to be employed for the first protocol stack layer is selected based on an amount of non-payload inter-node communication and requirements of the protocol stack layer.

Upon completing step 708, step 710 is performed where the MOO algorithm(s) for a second protocol stack layer is (are) initialized and/or constrained using parameters derived from the Pareto Front generated for the first protocol stack layer. The second protocol stack layer can include, but is not limited to, the data link layer if the “bottom up” process is employed or the presentation layer if the “top down” process is employed. It should be noted that the second protocol stack layer may include the transport layer instead of the presentation layer in scenarios where the presentation layer and session layers are not used by the cognitive network. In a next step 712, a second Pareto Front for the second protocol stack is determined by solving the MOO algorithm(s) that was (were) initialized and/or constrained in previous step 710.

Thereafter, a decision is made as to whether a Pareto Front for all of the protocol stack layers has been determined. If a Pareto Front for all the protocol stack layers requiring one has not been determined [714:NO], then step 716 is performed where a Pareto Front for a next protocol stack layer is determined using MOO algorithm(s) that were initialized and/or constrained using parameters derived from the Pareto Front previously computed for the immediately preceding protocol stack layer that required the computation of a Pareto Front. For example, a third Pareto Front may be determined in step 716 for the network layer or session layer. In this scenario, the third Pareto Front could be determined using MOO algorithm(s) that were initialized and/or constrained using parameters derived from the Pareto Front generated for the immediately preceding protocol stack layer, i.e., the data link layer or the presentation layer. Embodiments are not limited to the particularities of this example.

Upon completing step 716, the method 700 returns to step 714 so that a decision can be made again as to whether a Pareto Front for all of the protocol stack layers has been determined. If a Pareto Front for all of the protocol stack layers has been determined [714:YES], then step 718 is performed where the Pareto Fronts are analyzed in aggregate to develop a plurality of best overall network solutions. The best overall network solutions can be developed using a case-based reasoning algorithm, an expert system algorithm or a neural network algorithm. The best overall network solutions are then ranked according to a pre-defined criteria, as shown by step 720. A top ranked solution is identified in step 722 for the best overall network solutions that comply with current regulatory policies and/or project/mission policies. Subsequent to completing step 722, step 724 is performed where configuration parameters are computed for protocols of the protocol stack layers that enable implementation of the top ranked solution within the cognitive network. The top ranked solution is implemented in the cognitive network by configuring the network resources (e.g., hardware and software resources of network nodes 302-310 of FIG. 3) thereof in accordance with the configuration parameters, as shown by step 726. Upon completing step 726, step 728 is performed where method 700 ends or other processing is performed.

As a consequence of employing MOO algorithms, the configuration parameters dynamically change based on changes in at least one of a project, a mission, a network topology and an operating environment. Also, the MOO algorithms and/or parameters therefore can be dynamically adjusted in accordance with changes in at least one of network requirements and network conditions. Furthermore, in distributed implementations, the computational loading is dynamically partitioned across all active network nodes of the cognitive network based on a number of network nodes, node information density, and system level computational requirements.

All of the apparatus, methods and algorithms disclosed and claimed herein can be made and executed without undue experimentation in light of the present disclosure. While the invention has been described in terms of preferred embodiments, it will be apparent to those of skill in the art that variations may be applied to the apparatus, methods and sequence of steps of the method without departing from the concept, spirit and scope of the invention. More specifically, it will be apparent that certain components may be added to, combined with, or substituted for the components described herein while the same or similar results would be achieved. All such similar substitutes and modifications apparent to those skilled in the art are deemed to be within the spirit, scope and concept of the invention as defined. 

We claim:
 1. A method for providing a cognitive network, comprising: generating, by at least one network node of said cognitive network, initialization parameters for at least one first Multi-Objective Optimization (“MOO”) algorithm based on project requirements; determining, by said network node, a first Pareto Front for a first protocol stack layer of a protocol stack by solving said first MOO algorithm using said initialization parameters; performing, by said network node, operations to initialize or constrain at least one second MOO algorithm using the first Pareto Front; determining, by said network node, a second Pareto Front for a second protocol stack succeeding said first protocol stack layer in said protocol stack using said second MOO algorithm; analyzing, by said network node, at least said first and second Pareto Fronts in aggregate to develop a plurality of best overall network solutions; ranking, by said network node, said plurality of best overall network solutions according to a pre-defined criteria; identifying, by said network node, a top ranked solution for said plurality of best overall network solutions that complies with current regulatory and project policies; computing, by said network node, configuration parameters for protocols of said first protocol stack layers that enable implementation of said top ranked solution within said cognitive network; and dynamically re-configuring network resources of said first and second protocol stack layers using said configuration parameters.
 2. The method according to claim 1, wherein said initialization parameters are generated using information specifying a status and constraints that apply to protocol stack layer resources of at least one network node.
 3. The method according to claim 1, wherein said initialization parameters are generated using information concerning resources that are available on each network node of said cognitive network.
 4. The method according to claim 1, wherein said initialization parameters are generated in a distributed fashion in which at least two network nodes of said cognitive network assist in computing said initialization parameters.
 5. The method according to claim 1, wherein said initialization parameters are generated in a centralized fashion in which a single network node of said cognitive network computes said initialization parameters.
 6. The method according to claim 1, wherein at least one of said first and second MOO algorithms comprises a biologically inspired particle swarm optimization algorithm.
 7. The method according to claim 6, wherein said biologically inspired particle swarm optimization algorithm is used for at least one of a physical layer, a data link layer and a network layer of said protocol stack.
 8. The method according to claim 1, wherein a different type of MOO algorithm is employed for said first and second protocol stack layers.
 9. The method according to claim 1, wherein at least one of a number of MOO algorithms and a type of a distributed MOO algorithm to be employed for at least one of said first and second protocol stack layers is selected based on requirements thereof and an amount of non-payload inter-node communication.
 10. The method according to claim 1, further comprising dynamically changing said configuration parameters based on changes in at least one of a project, a mission, a network topology and an operating environment.
 11. A system, comprising: at least one network node configured to generate initialization parameters for at least one first Multi-Objective Optimization (“MOO”) algorithm based on project requirements, determine a first Pareto Front for a first protocol stack layer of a protocol stack by solving said first MOO algorithm using said initialization parameters, perform operations to initialize or constrain at least one second MOO algorithm using the first Pareto Front, determine a second Pareto Front for a second protocol stack succeeding said first protocol stack layer in said protocol stack using said second MOO algorithm, analyze at least said first and second Pareto Fronts in aggregate to develop a plurality of best overall network solutions, rank said plurality of best overall network solutions according to a pre-defined criteria, identify a top ranked solution for said plurality of best overall network solutions that complies with current regulatory and project policies, compute configuration parameters for protocols of said protocol stack layers that enable implementation of said top ranked solution within said system, and dynamically re-configure network resources of said first and second protocol stack layers using said configuration parameters.
 12. The system according to claim 11, wherein said initialization parameters are generated using information specifying a status and constraints that apply to protocol stack layer resources of at least one network node.
 13. The system according to claim 11, wherein said initialization parameters are generated using information concerning resources that are available on each network node of said system.
 14. The method according to claim 11, wherein said initialization parameters are generated in a distributed fashion in which at least two network nodes of said system assist in computing said initialization parameters.
 15. The system according to claim 11, wherein said initialization parameters are generated in a centralized fashion in which a single network node of said system computes said initialization parameters.
 16. The system according to claim 11, wherein at least one of said first and second MOO algorithms comprises a biologically inspired particle swarm optimization algorithm.
 17. The system according to claim 16, wherein said biologically inspired particle swarm optimization algorithm is used for at least one of a physical layer, a data link layer and a network layer of said protocol stack.
 18. The system according to claim 11, wherein a different type of MOO algorithm is employed for said first and second protocol stack layers.
 19. The system according to claim 11, wherein at least one of a number of MOO algorithms and a type of a distributed MOO algorithm to be employed for at least one of said first and second protocol stack layers is selected based on requirements thereof and an amount of non-payload inter-node communication.
 20. The system according to claim 11, wherein said network node is further configured to dynamically change said configuration parameters based on changes in at least one of a project, a mission, a network topology and an operating environment. 